Dynamic Round Robin with Controlled Preemption (DRRCP)

Round Robin (RR) CPU scheduling algorithm has been designed chiefly for time sharing systems. The RR algorithm has proven to be more useful in multiprogramming environment in which time slice or quantum is given to processes in the ready queue. An ideal classical RR uses a static quantum time which is gotten from the average of processes in the ready queue. One of the major challenges in classical RR is poor timing in performing context switching. This will eventually lead to unnecessary context switching. Using Dynamic Round Robin with Controlled Preemption (DRRCP), variable quantum time is used to eliminate this shortcoming. In an attempt to eliminate unnecessary context switching, the average waiting time, average turnaround time and number of context switching were as well improved. All dataset used for this analysis are generated using normal distribution function.